First Come , First Served ' can be unstable !
نویسنده
چکیده
We consider exible manufacturing systems using thèFirst Come, First Served' (FCFS or FIFO) scheduling policy at each machine. We describe and discuss in some detail simple deterministic examples which have adequate capacity but which, under FCFS, can exhibit instability: unboundedly growing WIP taking the form of a repeated pattern of behavior with the repetitions on an increasing scale.
منابع مشابه
On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number of vertices). This algorithm is optimal – there is no on-line deterministic algorithm that achieves a competitive ratio better than (2n − 1) in all metric spaces. We also study the stable marriage problem, where we are in...
متن کاملA heuristic method for consumable resource allocation in multi-class dynamic PERT networks
This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...
متن کاملLong Waiting Times for Elective Hospital Care – Breaking the Vicious Circle by Abandoning Prioritisation
Background Policies assigning low-priority patients treatment delays for care, in order to make room for patients of higher priority arriving later, are common in secondary healthcare services today. Alternatively, each new patient could be granted the first available appointment. We aimed to investigate whether prioritisation can be part of the reason why waiting times for care are often...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملA Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy
This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...
متن کامل